n - Cube network : node disjoint shortest paths for maximal distance pairs of vertices q
نویسندگان
چکیده
In parallel and distributed systems many communications take place concurrently, so the routing algorithm as well as the underlying interconnection network play a vital role in delivering all the messages efficiently. Fault tolerance and performance are often obtained by delivering the messages through node disjoint shortest paths. In this paper we present two efficient algorithms to construct, under certain conditions, pairwise node disjoint shortest paths for pairs of vertices in an n-cube in the presence of faulty nodes. The first algorithm has O(m) time complexity, where m is the number of input bits, and the second one takes O(m), but it solves more general problem instances. We also present an efficient algorithm for the extreme version of the edge disjoint shortest paths problem when n is odd. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Pairwise edge disjoint shortest paths in the n-cube
Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem.An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is ...
متن کاملTwo conditions for reducing the maximal length of node-disjoint paths in hypercubes
Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m ≤ n. For general case, their maximal length is not greater than the minimum of n + 1 and the ...
متن کاملMonotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any ` disjoint source-sink pairs on the directed hypercube can be connected with edge-disjoint paths, then monotonicity of...
متن کاملConstructing Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Cover in Augmented Cubes
The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are that the diameter is only about half of the diameter ...
متن کامل